Chris Pollett > Old Classes >
CS156
( Print View )

Student Corner:
  [Grades Sec1]

  [Submit Sec1]

  [Class Sign Up Sec1]

  [Lecture Notes]
  [Discussion Board]

Course Info:
  [Texts & Links]
  [Topics/Outcomes]
  [Outcomes Matrix]
  [Grading]
  [HW/Quiz Info]
  [Exam Info]
  [Regrades]
  [Honesty]
  [Additional Policies]
  [Announcements]

HWs and Quizzes:
  [Hw1]  [Hw2]  [Hw3]
  [Hw4]  [Hw5]  [Quizzes]

Practice Exams:
  [Mid]  [Final] 

                           












CS156 Spring 2012Practice Midterm

To study for the midterm I would suggest you: (1) Know how to do (by heart) all the practice problems. (2) Go over your notes at least three times. Second and third time try to see how much you can remember from the first time. (3) Go over the homework problems. (4) Try to create your own problems similar to the ones I have given and solve them. (5) Skim the relevant sections from the book. (6) If you want to study in groups, at this point you are ready to quiz each other. The practice midterm is below. Here are some facts about the actual midterm: (a) It is closed book, closed notes. Nothing will be permitted on your desk except your pen (pencil) and test. (b) You should bring photo ID. (c) There will be more than one version of the test. Each version will be of comparable difficulty. (d) One problem (less typos) on the actual test will be from the practice test.

  1. Briefly say what the Total Turing Test is, what a rational agent is.
  2. Give the formal way to specify a problem for a problem solving agent.
  3. Give an example problem and then explain how iterative deepening search might search the environment of this problem to find a goal. Explain the run time and space complexity of IDS.
  4. What is the difference between Greedy-Best-First Search and A* search? Give an example situation where the latter might perform better than the former.
  5. Give an example of each of the following programming language feature in Python: generators, coroutines, lambda.
  6. Describe each of the following local search algorithms: (a) random-hill climbing with restarts, (b) local beam search.
  7. What is an adversarial search problem? Zero-sum game? Optimal Strategy?
  8. Give the minimax algorithm. Give an example of a situation in which an alpha-cut might be made. Give an example of a situation in which an beta-cut might be made.
  9. Briefly explain the AC-3 algorithm, and show how it might be applied to a particular CSP.
  10. Give a resolution refutation of the following clauses: {a, not b}, {b, not c}, {c}, {not a}.